منابع مشابه
The guarding game is E-complete
The guarding game is a game in which several cops try to guard a region in a (directed or undirected) graph against a robber. The robber and the cops are placed on the vertices of the graph; they take turns in moving to adjacent vertices (or staying), cops inside the guarded region, the robber on the remaining vertices (the robber-region). The goal of the robber is to enter the guarded region a...
متن کاملOrthogonal Terrain Guarding is NP-complete
A terrain is an x-monotone polygonal curve, i.e., successive vertices have increasing x-coordinates. Terrain Guarding can be seen as a special case of the famous art gallery problem where one has to place at most k guards on a terrain made of n vertices in order to fully see it. In 2010, King and Krohn showed that Terrain Guarding is NP-complete [SODA ’10, SIAM J. Comput. ’11] thereby solving a...
متن کاملOn the complexity of the guarding game
The guarding game is a game in which several cops try to guard a region in a (directed or undirected) graph against a robber. The robber and the cops are placed on the vertices of the graph; they take turns in moving to adjacent vertices (or staying), cops inside the guarded region, the robber on the remaining vertices (the robber-region). The goal of the robber is to enter the guarded region a...
متن کاملDetermined Game Logic is Complete
Non-determined game logic is the logic of two player board games where the game may end in a draw: unlike the case with determined games, a loss of one player does not necessarily constitute of a win of the other player. A calculus for non-determined game logic is given in [4] and shown to be complete. The calculus adds a new rule for the treatment of greatest fixpoints, and a new unfolding axi...
متن کاملRandolph’s Robot Game is NP-complete!
We introduce a new type of movement constraints for a swarm of robots in a grid environment. This type is inspired by Alex Randolphs board game Ricochet Robot and may be used to model robots with very limited abilities for self localization: We assume that once a robot starts to drive in a certain direction, it does not stop its movement until it hits an obstacle wall or another robot. We show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.034